A complexity calculus for recursive tree algorithms
نویسندگان
چکیده
منابع مشابه
On the Complexity of Recursive Tree-Based Algorithms for Computing Distance Histograms
Particle simulation has become a popular research tool in many scientific and engineering fields. Analysis of particle simulation data involves computing functions of all particle-toparticle interactions. One such analytics, the spatial distance histogram (SDH), is of vital importance to scientific discovery from particle simulation data. Algorithms for efficiently SDH processing in large-scale...
متن کاملAlgorithmic complexity of recursive and inductive algorithms
The main goal of this paper is to compare recursive algorithms such as Turing machines with such super-recursive algorithms as inductive Turing machines. This comparison is made in a general setting of dual complexity measures such as Kolmogorov or algorithmic complexity. To make adequate comparison, we reconsider the standard axiomatic approach to complexity of algorithms. The new approach all...
متن کاملParallelization of Tree-Recursive Algorithms on a SIMD Machine
The set of tree-recursive algorithms is large, including constraint satisfaction using backtracking, iterative-deepening search such as IDA*, depth-first branch-and-bound, twoplayer game minimax search, and many divide-and-conquer algorithms. We describe a structured method for implementing such algorithms on SIMD machines, and identify measures for determining if a tree-recursive application i...
متن کاملA Resolution Calculus for Recursive Clause Sets
Proof schemata provide an alternative formalism for proofs containing an inductive argument, which allow an extension of Herbrand’s theorem and thus, the construction of Herbrand sequents and expansion trees. Existing proof transformation methods for proof schemata rely on constructing a recursive resolution refutation, a task which is highly non-trivial. An automated method for constructing su...
متن کاملOn the Recursive Depth of Special Tree Traversal Algorithms
In this paper we are concerned with the analysis of special recursive algorithms for traversing the nodes of a planted plane tree (ordered tree ; planar tree) . Some by now classical results in this area are due to (de Bruijn, Knuth, and Rice, 1972 ; Knuth, 1973 ; Flajolet, 1981 ; Flajolet and Odlyzko, 1982 ; Flajolet, Raoult, and Vuillemin, 1979 ; Kemp, 1979) and others and are summarized in t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Systems Theory
سال: 1986
ISSN: 0025-5661,1433-0490
DOI: 10.1007/bf01704918